(Un)Reliable Concessions in Static and Dynamic Bargaining Experiments
نویسندگان
چکیده
A two-persons bargaining problem often consists of initially incompatible demands that can be unilaterally reduced by sequential concessions. In a 2 × 2 × 2– factorial design we distinguish between reliable and unreliable concessions, between a static and dynamic settings and between symmetric and asymmetric initial demands. Whereas reliable concessions change the threat point, unreliable concessions do not. In the dynamic setting each player’s concession can be conditional on the previous history of play; in the static setting a player’s concessions for all bargaining trials are determined at the beginning of the game. In all situations conflict is triggered if neither gives in, or if a maximum number of trials is reached without a feasible agreement. Although our results indicate that conflict is more likely if concessions are reliable, the overall efficiency of both institutions is similar.
منابع مشابه
Monotonic Mixing of Decision Strategies for Agent-Based Bargaining
In automated bargaining a common method to obtain complex concession behaviour is to mix individual tactics, or decision functions, by a linear weighted combination. In such systems, the negotiation process between agents using mixed strategies with imitative and non-imitative tactics is highly dynamic, and non-monotonicity in the sequence of utilities of proposed offers can emerge at any time ...
متن کاملReliability of Functional Balance Assessment Tests in Children aged 7-10 and its Correlation with Selected Anthropometric Parameters
Introduction: The present study evaluates reliability of functional balance assessment tests in children aged 7-10 and its correlation with selected anthropometric parameters. Methodology: Population of the study includes 80 students aged 7-10 (40 female and 40 male). The Sharpened Romberg Test was used for static balance, while timed up and go test, Tandem walk test, and Y test were used for ...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملDoes Scale of Public Hospitals Affect Bargaining Power? Evidence From Japan
Background Many of public hospitals in Japan have had a deficit for a long time. Japanese local governments have been encouraging public hospitals to use group purchasing of drugs to benefit from the economies of scale, and increase their bargaining power for obtaining discounts in drug purchasing, thus improving their financial situation. In this study, we empirically investigate whether or no...
متن کاملA PSO-Based Static Synchronous Compensator Controller for Power System Stability Enhancement
In this paper Power system stability enhancement through static synchronous compensator (STATCOM)based controller is investigated. The potential of the STATCOM supplementary controllers to enhance thedynamic stability is evaluated. The design problem of STATCOM based damping controller is formulatedas an optimization problem according to the eigenvalue based objective function that is solved by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005